Search results for "Minimum size"

showing 1 items of 1 documents

The minimum size of fully irregular oriented graphs

2001

Abstract Digraphs in which any two vertices have different pairs of semi-degrees are called fully irregular. For n-vertex fully irregular oriented graphs (i.e. digraphs without loops or 2-dicycles) the minimum size is presented.

Discrete mathematicsCombinatoricsMathematics::CombinatoricsComputer Science::Discrete MathematicsDiscrete Mathematics and CombinatoricsMinimum sizeOriented graphIrregular digraphMathematicsTheoretical Computer ScienceDiscrete Mathematics
researchProduct